Description: 背包问题，背包问题的5种算法，一共五个文件，每个文件一种算法-Knapsack problem, knapsack problem of the five kinds of algorithms, a total of five files, each file an algorithm Platform: |
Size: 5120 |
Author:司马俊杰 |
Hits:
Description: 0／1背包问题的贪心优化解法 邓宏涛朱蜘
(江汉大学数学与计算机学院武汉430056)
摘要：介绍了0／1背包问题的基本贪心算法的解决策略，通过对贪心算法的改进和优化，找出0／1背包问题的最优解
的很好近似。-0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation. Platform: |
Size: 175104 |
Author:qqq |
Hits:
Description: 背包问题的最优并行算法，毕业设计，利用分治策略-Knapsack problem of the optimal parallel algorithm, graduation design, the use of sub-rule strategy Platform: |
Size: 313344 |
Author:syzqgj |
Hits:
Description: 货物配装问题实质上是背包问题与装箱问题的混合，有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划，最大限度地发挥货车容积和承载能力，从而降低配送成本。-Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with a wide range of applications. Loading refers to the full use of means of transport (such as trains, trucks, ships, etc., this paper mainly refers to goods) and the load volume, using advanced loading methods, rational arrangements for cargo loading plan maximizing the volume of goods and carrying capacity, thereby reducing distribution costs. Platform: |
Size: 6144 |
Author:廖志 |
Hits:
Description: 模拟退火算法解决背包问题，使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use. Platform: |
Size: 2048 |
Author:张苹 |
Hits:
Description: 这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm Platform: |
Size: 179200 |
Author:yangke |
Hits:
Description: C语言里面的经典算法，包括有老掉牙
河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
-Obsolete
Hanoi Tower
Fei-style series
Pascal triangle
Three-color Chess
Mouse walking fans Officer (1)
Mouse walking fans Officer (2)
Knight walking board
8 Queens
8 coins
Game of Life
String matching
Two-color, three-color Hanoi Tower
Knapsack problem (Knapsack Problem)
The number of operations
Monte Carlo method seeking PI
Eratosthenes prime number screened seeking
Long integer arithmetic (operations of large numbers)
Long PI
Greatest common factor, least common multiple, factorization
Perfect Number
阿姆斯壮数
Maximum number of visitors
Type in order to switch the order of type (pre-order type)
Follow-style computing
About Gambling
Wash cards (random order)
Craps Casino Games
Joseph problems (Josephus Problem)
Set problem
Permutations
Gray code (Gray Code)
Generate the set of possible
m elements of the collection a subset of n elements
Digital dismantling
Sort
Score Ranking
Selection, insertion, bubble sort
Shell Platform: |
Size: 441344 |
Author:neoleo |
Hits:
Description: 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about friends. Platform: |
Size: 1024 |
Author:小吴 |
Hits:
Description: 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm. Platform: |
Size: 1024 |
Author:hyqin |
Hits:
Description: 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem Platform: |
Size: 1052672 |
Author:hehuiling |
Hits:
Description: java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas. Platform: |
Size: 1024 |
Author:liangsi |
Hits:
Description: 0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method. Platform: |
Size: 727040 |
Author:储大为 |
Hits:
Search - knapsack problem